Sidelobe Minimisation in Integer-Positioned Sparse Antenna Arrays

نویسنده

  • NICHOLAS K. SPENCER
چکیده

– Modern array signal processing applications place great demands on the underlying antenna array geometry to deliver high performance. This paper discusses a computational solution to an integer multicriteria optimisation (MO) problem that arises in a certain class of nonuniform linear array (NLA) design. “Fully augmentable” arrays have a full and complete set of covariance lag differences; within the class of fully augmentable geometries, we seek an -sensor layout that yields the smallest sidelobes in the array beam pattern, possibly only within a particular angular range. The proposed method permits near-optimal minimisation in a feasible amount of computer time. Key-Words: – Antenna arrays, sparse array geometry, integer optimisation, sidelobe minimisation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Synthesis of Antenna Arrays of Maximum Directivity for a Specified Sidelobe Level

Linear and planar antenna arrays are synthesized to have maximum directivity for a specified sidelobe level. The directivity is maximized subject to a given SLL. The beamwidth and the zeros of array factor are studied as well as the directivity. Maximum directivity-arrays are compared through some examples with super-directive, uniform, Dolph-Chebyshev and Riblet-Chebychev arrays to find a comp...

متن کامل

A Hybrid Optimization for Pattern Synthesis of Large Antenna Arrays

The pattern synthesis for large antenna arrays has drawn significant attention because of its wide applications. This paper introduces a hybrid approach for the fast pencil beam pattern synthesis of the large non-uniform linear or planar array, which can significantly reduce the computational cost, the number of antenna in the array, the minimum sidelobe level and the null control. The proposed...

متن کامل

Weight- and Layout-Optimized Sparse Arrays

Theory for random arrays predicts a mean sidelobe level given by the inverse of the number of elements. In this paper two optimization methods for thinned arrays are given: one is for optimizing the weights of each element, and the other one optimizes both the layout and the weights. The weight optimization algorithm is based on linear programming and minimizes the peak sidelobe level for a giv...

متن کامل

Optimization of the Beampattern of 2D Sparse Arrays by Weighting

A method is presented which optimizes weights of general planar 1D and 2D symmetric full and sparse arrays. The objective is to nd a weighting of the array elements which gives the minimum sidelobe level of the array pattern in a speci ed region the stopband. The sidelobe level is controlled on a discrete set of points from this region. The method minimizes the Chebyshev norm of the sidelobe le...

متن کامل

On beam design for sparse arrays of subarrays using multi-objective optimization and estimation-theoretic criteria

Compact antenna arrays with a moderately large number of elements (e.g., 16 elements in a 4× 4 planar configuration) can be realized at low cost at millimeter wave frequencies. This provides the opportunity for cost-effective synthesis of large aperture antenna arrays using sparse placement of such compact “subarrays”. In this paper, we investigate the design of arrays of subarrays constructed ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005